См. также в других словарях:
Interactive theorem proving — is the field of computer science and mathematical logic concerned with tools to develop formal proofs by man machine collaboration. This involves some sort of proof assistant: an interactive proof editor, or other interface, with which a human… … Wikipedia
Isabelle (theorem prover) — Infobox Software name = Isabelle caption = collapsible = author = developer = released = latest release version = latest release date = latest maintenance version = latest maintenance date = latest preview version = latest preview date =… … Wikipedia
LCF (theorem prover) — LCF (Logic for Computable Functions) is an interactive automated theorem prover developed at the universities of Edinburgh and Stanford by Robin Milner and others. LCF introduced the general purpose programming language ML to allow users to write … Wikipedia
SNARK theorem prover — SNARK, SRI s New Automated Reasoning Kit, is a theorem prover for multi sorted first order logic intended for applications in artificial intelligence and software engineering. SNARK s principal inference mechanisms are resolution and… … Wikipedia
Tau (theorem prover) — Tau is a robust and general purpose, interactive (live on the web), user configurable automated theorem prover for first order predicate logic with equality. Tau proves both theorems and arguments expressed in unrestricted first order notation in … Wikipedia
Agda (theorem prover) — Agda is a theorem prover, i.e. a computer program that can check mathematical proofs. More specifically, it is an interactive system for developing constructive proofs in a variant of Per Martin Löf s Type Theory. It can also be seen as a… … Wikipedia
HOL theorem prover family — HOL (Higher Order Logic) denotes a family of interactive theorem proving systems sharingsimilar logics and implementation strategies. Systems in this family follow the LCF approach as they are implemented as a library in some programming language … Wikipedia
Interactive proof system — In computational complexity theory, an interactive proof system is an abstract machine that models computation as the exchange of messages between two parties. The parties, the verifier and the prover, interact by exchanging messages in order to… … Wikipedia
List of interactive geometry software — Interactive geometry software (IGS, or dynamic geometry environments, DGEs) are computer programs which allow one to create and then manipulate geometric constructions, primarily in plane geometry. In most IGS, one starts construction by putting… … Wikipedia
Automated theorem proving — (ATP) or automated deduction, currently the most well developed subfield of automated reasoning (AR), is the proving of mathematical theorems by a computer program. Decidability of the problem Depending on the underlying logic, the problem of… … Wikipedia
Larch Prover — Larch Prover, or LP for short, is an interactive theorem proving system for multisorted first order logic. It is currently used at MIT and elsewhere to reason about designs for circuits, concurrent algorithms, hardware, and software. Unlike most… … Wikipedia
